A System for Relational Probabilistic Reasoning on Maximum Entropy
نویسندگان
چکیده
Comparisons of different approaches to statistical relational learning are difficult due to the variety of the available concepts and due to the absense of a common interface. The main objective of the KREATOR toolbox introduced here is to provide a common methodology for modelling, learning, and inference in a relational probabilistic framework. As a second major contribution of this paper, we present the RME approach to relational probabilistic reasoning which applies the principle of maximum entropy to groundings of a relational knowledge base and which is also supported by KREATOR.
منابع مشابه
Relational Probabilistic Conditional Reasoning at Maximum Entropy
This paper presents and compares approaches for reasoning with relational probabilistic conditionals, i. e. probabilistic conditionals in a restricted first-order environment. It is well-known that conditionals play a crucial role for default reasoning, however, most formalisms are based on propositional conditionals, which restricts their expressivity. The formalisms discussed in this paper ar...
متن کاملRepresenting Statistical Information and Degrees of Belief in First-Order Probabilistic Conditional Logic
Employing maximum entropy methods on probabilistic conditional logic has proven to be a useful approach for commonsense reasoning. Yet, the expressive power of this logic and similar formalisms is limited due to their foundations on propositional logic and in the past few years a lot of proposals have been made for probabilistic reasoning in relational settings. Most of these proposals rely on ...
متن کاملOn probabilistic inference in relational conditional logics
The principle of maximum entropy has proven to be a powerful approach for commonsense reasoning in probabilistic conditional logics on propositional languages. Due to this principle, reasoning is performed based on the unique model of a knowledge base that has maximum entropy. This kind of model-based inference fulfills many desirable properties for inductive inference mechanisms and is usually...
متن کاملA Generalized Iterative Scaling Algorithm for Maximum Entropy Reasoning in Relational Probabilistic Conditional Logic Under Aggregation Semantics
Recently, different semantics for relational probabilistic conditionals and corresponding maximum entropy (ME) inference operators have been proposed. In this paper, we study the so-called aggregation semantics that covers both notions of a statistical and subjective view. The computation of its inference operator requires the calculation of the ME-distribution satisfying all probabilistic cond...
متن کاملOn Prototypical Indifference and Lifted Inference in Relational Probabilistic Conditional Logic
Semantics for formal models of probabilistic reasoning rely on probability functions that are defined on the interpretations of the underlying classical logic. When this underlying logic is of relational nature, i. e. a fragment of first-order logic, then the space needed for representing these probability functions explicitly is exponential in both the number of predicates and the number of do...
متن کامل